The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees
نویسندگان
چکیده
منابع مشابه
The Hypersimple-Free C.E. WTT Degrees Are Dense in the C.E. WTT Degrees
We show that in the c.e. weak truth table degrees if b < c then there is an a which contains no hypersimple set and b < a < c. We also show that for every w < c in the c.e. wtt degrees such that w is hypersimple, there is a hypersimple a such that w < a < c. On the other hand we know that there are intervals which contain no hypersimple set.
متن کاملOn minimal wtt-degrees and computably enumerable Turing degrees
Computability theorists have studied many different reducibilities between sets of natural numbers including one reducibility (≤1), many-one reducibility (≤m), truth table reducibility (≤tt), weak truth table reducibility (≤wtt) and Turing reducibility (≤T ). The motivation for studying reducibilities stronger that Turing reducibility stems from internally motivated questions about varying the ...
متن کاملApproximation representations for reals and their wtt-degrees
We study the approximation properties of computably enumerable reals. We deal with a natural notion of approximation representation and study their wtt-degrees. Also, we show that a single representation may correspond to a quite diverse variety of reals.
متن کاملThe Theories of the T, tt and wtt R. E. Degrees: Undecidability and Beyond
We discuss the structure of the recursively enumerable sets under three reducibilities: Turing, truth-table and weak truth-table. Weak truth-table reducibility requires that the questions asked of the oracle be effectively bounded. Truth-table reducibility also demands such a bound on the the length of the computations. We survey what is known about the algebraic structure and the complexity of...
متن کاملA lower cone in the wtt degrees of non-integral effective dimension
Since the introduction of effective dimension concepts by Lutz [8, 9], considerable effort has been put into studying the effective or resource-bounded dimension of objects occurring in computability or complexity theory. However, up to now there are basically only three types of examples known for individual sets of non-integral effective dimension: The first consists of sets obtained by ‘dilu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Notre Dame Journal of Formal Logic
سال: 2006
ISSN: 0029-4527
DOI: 10.1305/ndjfl/1163775443